Kernel interpolation
نویسندگان
چکیده
In mathematics, the task of interpolating observed data has a long history. Recently, this task has gained even more attention, also from a statistical point of view, as there are many data situations, where either there is no random error (e.g. computer experiments) or the underlying data generating process is very precise such that a repetition will yield the same numerical result. Here we present a new approach to data interpolation which is related to kernel regression estimators and which performs well for small sample sizes in lower dimensions, compared to a standard Kriging approach.
منابع مشابه
A Modified Degenerate Kernel Method for the System of Fredholm Integral Equations of the Second Kind
In this paper, the system of Fredholm integral equations of the second kind is investigated by using a modified degenerate kernel method (MDKM). To construct a MDKM the source function is approximated by the same way of producing degenerate kernel. The interpolation is used to make the needed approximations. Lagrange polynomials are adopted for the interpolation. The equivalency of proposed m...
متن کاملAn effective method for approximating the solution of singular integral equations with Cauchy kernel type
In present paper, a numerical approach for solving Cauchy type singular integral equations is discussed. Lagrange interpolation with Gauss Legendre quadrature nodes and Taylor series expansion are utilized to reduce the computation of integral equations into some algebraic equations. Finally, five examples with exact solution are given to show efficiency and applicability of the method. Also, w...
متن کاملArmin Iske * Scattered Data Approximation by Positive Definite Kernel Functions
Kernel functions are suitable tools for scattered data interpolation and approximation. We first review basic features of kernel-based multivariate interpolation, before we turn to the construction and the characterization of positive definite kernels and their associated reproducing kernel Hilbert spaces. The optimality of the resulting kernel-based interpolation scheme is shown. Moreover, we ...
متن کاملKernel Interpolation for Scalable Structured Gaussian Processes (KISS-GP)
We introduce a new structured kernel interpolation (SKI) framework, which generalises and unifies inducing point methods for scalable Gaussian processes (GPs). SKI methods produce kernel approximations for fast computations through kernel interpolation. The SKI framework clarifies how the quality of an inducing point approach depends on the number of inducing (aka interpolation) points, interpo...
متن کاملGaussian Convolutions. Numerical Approximations Based on Interpolation
Gaussian convolutions are perhaps the most often used image operators in low-level computer vision tasks. Surprisingly though, there are precious few articles that describe efficient and accurate implementations of these operators. In this paper we describe numerical approximations of Gaussian convolutions based on interpolation. We start with the continuous convolution integral and use an inte...
متن کاملA new Image Interpolation Technique using Exponential B-Spline
In this paper, we propose a new interpolation technique using exponential B-spline, which is super-set of the Bspline. An interpolation kernel of exponential B-spline was proposed using IIR based technique by Unser. As another approach, this paper presents an exponential B-spline interpolation kernel using simple mathematics based on Fourier approximation. A high signal to noise ratio can be ac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computational Statistics & Data Analysis
دوره 55 شماره
صفحات -
تاریخ انتشار 2011